Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
نویسندگان
چکیده
منابع مشابه
Classical-Quantum Arbitrarily Varying Wiretap Channel
The arbitrarily varying channel models transmission over a channel with an state that can change over time. We may interpret it as a channel with an evil jammer. The arbitrarily varying channel was first introduced by Blackwell, Breiman, and Thomasian in [8]. The wiretap channel models communication with security. It was first introduced by Wyner in [12]. We may interpret it as a channel with a...
متن کاملClassical-quantum arbitrarily varying wiretap channel: Ahlswede dichotomy, positivity, resources, super-activation
We establish the Ahlswede dichotomy for arbitrarily varying classicalquantum wiretap channels, i.e., either the deterministic secrecy capacity of the channel is zero, or it equals its randomness-assisted secrecy capacity. We analyze the secrecy capacity of these channels when the sender and the receiver use various resources. It turns out that randomness, common randomness, and correlation as r...
متن کاملMIMO Wiretap Channels with Arbitrarily Varying Eavesdropper Channel States
In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel of the eavesdropper is arbitrarily varying over time. Assuming that the number of antennas of the eavesdropper is limited, the secrecy rate of the MIMO wire...
متن کاملCapacity Results for Arbitrarily Varying Wiretap Channels
In this work the arbitrarily varying wiretap channel AVWC is studied. We derive a lower bound on the random code secrecy capacity for the average error criterion and the strong secrecy criterion in the case of a best channel to the eavesdropper by using Ahlswede’s robustification technique for ordinary AVCs. We show that in the case of a non-symmetrisable channel to the legitimate receiver the ...
متن کاملEntanglement-assisted classical capacities of compound and arbitrarily varying quantum channels
We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In this way, we obtain single-letter characterizations of the entanglement-assisted classical capacities for both channel models. Moreover, we show that the ent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2016
ISSN: 1570-0755,1573-1332
DOI: 10.1007/s11128-016-1473-y